Fizikos terminų žodynas : lietuvių, anglų, prancūzų, vokiečių ir rusų kalbomis. – Vilnius : Mokslo ir enciklopedijų leidybos institutas. Vilius Palenskis, Vytautas Valiukėnas, Valerijonas Žalkauskas, Pranas Juozas Žilinskas. 2007.
Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron … Wikipedia
Hamiltonian path problem — This article is about the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph. For the general graph theory concepts, see Hamiltonian path. In the mathematical field of graph theory the Hamiltonian path… … Wikipedia
Hamiltonian completion — The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian.The problem is clearly NP hard in general case (since its solution gives an answer to the NP complete problem of determining… … Wikipedia
Hamiltonian constraint — In loop quantum gravity, dynamics such as time evolutions of fields are controlled by the Hamiltonian constraint. The identity of the Hamiltonian constraint is a major open question in quantum gravity, as is extracting of physical observables… … Wikipedia
Complete set of commuting observables — In quantum mechanics, a complete set of commuting observables (CSCO) is a set of commuting operators whose eigenvalues completely specify the state of a system (Gasiorowicz 1974, p. 119). For example, in the case of the hydrogen atom, the… … Wikipedia
total Hamiltonian — pilnutinis hamiltonianas statusas T sritis fizika atitikmenys: angl. complete Hamiltonian; total Hamiltonian vok. vollständiger Hamiltonoperator, m rus. полный гамильтониан, m pranc. hamiltonien complet, m; hamiltonien total, m … Fizikos terminų žodynas
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Dyall Hamiltonian — In quantum chemistry, the Dyall Hamiltonian is a modified Hamiltonian with two electron nature. It can be written as follows … Wikipedia
Karp's 21 NP-complete problems — One of the most important results in computational complexity theory was Stephen Cook s 1971 demonstration of the first (practically relevant) NP complete problem, the boolean satisfiability problem. [cite book|author = Stephen Cook|year =… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
